a heuristic algorithm for nonlinear lexicography goal programming with an efficient initial solution

نویسندگان

mahdi bashiri

amir hossein parsa manesh

hamid hasanzadeh

چکیده

in this paper,  a heuristic algorithm is proposed in order to solve a nonlinear lexicography goal programming (nlgp) by using an efficient initial point. some numerical experiments showed that the search quality by the proposed heuristic in a multiple objectives problem depends on the initial point features, so in the proposed approach the initial point is retrieved by data envelopment analysis to be selected as an efficient solution. there are some weaknesses in classic nlgp algorithm that lead to trapping into the local optimum, so a simulated annealing concept is implemented during the searching stage to increase the diversity of search in the solution space. some numerical examples with different sizes were generated and comparison of results confirms that the proposed solution heuristic is more efficient than the classic approach. moreover the proposed approach was extended for cases with ordinal weights of inputs or outputs. the computational experiments for 5 numerical instances and the statistical analysis indicate that the proposed heuristic algorithm is a robust procedure to find better preferred solution comparing to the classic nlgp.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Heuristic Algorithm for Nonlinear Lexicography Goal Programming with an Efficient Initial Solution

In this paper,  a heuristic algorithm is proposed in order to solve a nonlinear lexicography goal programming (NLGP) by using an efficient initial point. Some numerical experiments showed that the search quality by the proposed heuristic in a multiple objectives problem depends on the initial point features, so in the proposed approach the initial point is retrieved by Data Envelopment Analysis...

متن کامل

A Fuzzy Goal Programming Model for Efficient Portfolio Selection.

This paper considers a multi-objective portfolio selection problem imposed by gaining of portfolio, divided yield and risk control in an ambiguous investment environment, in which the return and risk are characterized by probabilistic numbers. Based on the theory of possibility, a new multi-objective portfolio optimization model with gaining of portfolio, divided yield and risk control is propo...

متن کامل

A Heuristic Approach for Solving LIP with the Optional Feasible or Infeasible Initial Solution Points

An interactive heuristic approach can offer a practical solution to the problem of linear integer programming (LIP) by combining an optimization technique with the Decision Maker’s (DM) judgment and technical supervision. This is made possible using the concept of bicriterion linear programming (BLP) problem in an integer environment. This model proposes two bicriterion linear programs for iden...

متن کامل

An efficient modified neural network for solving nonlinear programming problems with hybrid constraints

This paper presents ‎‎the optimization techniques for solving‎‎ convex programming problems with hybrid constraints‎.‎ According to the saddle point theorem‎, ‎optimization theory‎, ‎convex analysis theory‎, ‎Lyapunov stability theory and LaSalle‎‎invariance principle‎,‎ a neural network model is constructed‎.‎ The equilibrium point of the proposed model is proved to be equivalent to the optima...

متن کامل

Optimality and Duality for an Efficient Solution of Multiobjective Nonlinear Fractional Programming Problem Involving Semilocally Convex Functions

In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality...

متن کامل

An efficient algorithm for large scale stochastic nonlinear programming problems

The class of stochastic nonlinear programming (SNLP) problems is important in optimization due to the presence of nonlinearity and uncertainty in many applications, including those in the field of process systems engineering. But despite the apparent importance of such problems, the solution algorithms for these problems have found few applications due to the severe computational and structural...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
journal of optimization in industrial engineering

ناشر: qiau

ISSN 2251-9904

دوره 7

شماره 15 2014

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023